New leakage-resilient CCA-secure public key encryption
نویسندگان
چکیده
منابع مشابه
New leakage-resilient CCA-secure public key encryption
This paper shows a generic method of constructing CCAsecure public key encryption schemes with leakage resilience on the secret key. It is based on a new kind of universal2 hash proof system which accepts an auxiliary parameter. Specifically, two schemes are presented, basing on the DCR assumption and DLIN assumption respectively.
متن کاملLeakage-Resilient Public-Key Encryption from Obfuscation
The literature on leakage-resilient cryptography contains various leakage models that provide different levels of security. In this work, we consider the bounded leakage and the continual leakage models. In the bounded leakage model (Akavia et al. – TCC 2009), it is assumed that there is a fixed upper bound L on the number of bits the attacker may leak on the secret key in the entire lifetime o...
متن کاملDefinition of Leakage-resilient Cca Encryption
Key Generation The challenger computes (pk, sk) ← Gen(1λ) and give pk to A. Test 1: The adversaryA (adaptively) submits decryption queries Ci and getsmi = Dsk(Ci). The adversary also (adaptviely) submits leakage queries fj : {0, 1} ∗ → {0, 1}lj and gets fj(sk). Challenge: The adversary A comes up with two message m0, m1. The challenger chooses a random bit b ← {0, 1} and gives A the value C∗ = ...
متن کاملLeakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of Pairing
In AsiaCrypt 2013, Qin and Liu proposed a new approach to CCA-security of Public-Key Encryption (PKE) in the presence of bounded key-leakage, from any universal hash proof system (due to Cramer and Shoup) and any one-time lossy filter (a simplified version of lossy algebraic filters, due to Hofheinz). They presented two instantiations under the DDH and DCR assumptions, which result in leakage r...
متن کاملEfficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions
KDM[F ]-CCA secure public-key encryption (PKE) protects the security of message f(sk), with f ∈ F , that is computed directly from the secret key, even if the adversary has access to a decryption oracle. An efficient KDM[Faff]-CCA secure PKE scheme for affine functions was proposed by Lu, Li and Jia (LLJ, EuroCrypt2015). We point out that their security proof cannot go through based on the DDH ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2013
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc-2013-5007